# distance vector algorithm

- A family of routing algorithms that calculate the bestpath route to use for data transmission from information present in adjacent nodes on the network. Routing information is broadcast periodically rather than only when a change occurs, which makes the method bandwidth intensive. For this reason, distance vector algorithm is best used in relatively small networks with few interrouter connections.

*Dictionary of networking .
2014.*

### Look at other dictionaries:

**Distance-vector routing protocol**— In computer communication theory relating to packet switched networks, a distance vector routing protocol is one of the two major classes of routing protocols, the other major class being the link state protocol. Distance vector routing protocols … Wikipedia**Ad-hoc On-demand Distance Vector**— AODV (pour Ad hoc On Demand Distance Vector) est un protocole de routage destiné aux réseaux mobiles (en mode ad hoc). Il est à la fois capable de routage Unicast et Multicast. Il est libre de boucle, auto démarrant et s accommode d un grand… … Wikipédia en Français**Destination-Sequenced Distance Vector routing**— (DSDV) is a table driven routing scheme for ad hoc mobile networks based on the Bellman Ford algorithm. It was developed by C. Perkins and P.Bhagwat in 1994. The main contribution of the algorithm was to solve the routing loop problem. Each entry … Wikipedia**Vector quantization**— is a classical quantization technique from signal processing which allows the modeling of probability density functions by the distribution of prototype vectors. It was originally used for data compression. It works by dividing a large set of… … Wikipedia**Distance of closest approach of ellipses and ellipsoids**— The distance of closest approach of two objects is the distance between their centers when they are externally tangent. The objects may be geometric shapes or physical particles with well defined boundaries. The distance of closest approach is… … Wikipedia**Vector space**— This article is about linear (vector) spaces. For the structure in incidence geometry, see Linear space (geometry). Vector addition and scalar multiplication: a vector v (blue) is added to another vector w (red, upper illustration). Below, w is… … Wikipedia**Distance**— This article is about distance in the mathematical or physical sense. For other senses of the term, see distance (disambiguation). Proximity redirects here. For the 2001 film, see Proximity (film). Distance (or farness) is a numerical description … Wikipedia**Vector slime**— In the demoscene (demo (computer programming)), vector slime refers to a class of visual effects achieved by procedural deformation of geometric shapes. Synopsis A geometric object exposed to vector slime is usually defined by vertices and faces… … Wikipedia**link-state routing algorithm**— A routing algorithm in which each router broadcasts information about the state of the links to all other nodes on the internetwork. This algorithm reduces routing loops but has greater memory requirements than the distance vector algorithm … Dictionary of networking**Bellman-Ford algorithm**— The Bellman–Ford algorithm, a label correcting algorithm [cite web |url=http://www.mit.edu/people/dimitrib/SLF.pdf |title=A Simple and Fast Label Correcting Algorithm for Shortest Paths |accessdate=2008 10 01 |author=Dimitri P. Bertsekas… … Wikipedia